/**
*      author: Y_Yao
*      created: 2025-01-25 12:46:07
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 7;
int dp[33];
int n;
int a[N],b[33];

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];
    for(int i = 1;i <= 31;i++) b[i] = (1 << (i - 1));

    int ans = 0;
    for(int i = 1;i <= n;i++)
    {
        int maxs = 0;
        for(int j = 1;j <= 31;j++)
        {
            if(a[i] & b[j]) maxs = max(maxs,dp[j]);
        }
        maxs++;
        for(int j = 1;j <= 31;j++)
        {
            if(a[i] & b[j]) dp[j] = maxs;
        }
    }

    for(int i = 1;i <= 31;i++) ans = max(ans,dp[i]);
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}